A simple algorithm for automatic Feynman diagram generation

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ALOHA: Automatic libraries of helicity amplitudes for Feynman diagram computations

We present an application that automatically writes the Helas library corresponding to the Feynman rules of any Lagrangian, renormalizable or not, in quantum field theory. The code, written in Python, takes the Universal FeynRules Output (Ufo) as an input and produces the complete set of routines (wavefunctions and amplitudes) that are needed for the computation of Feynman diagrams at leading a...

متن کامل

Automatic Feynman diagram calculation with xloops –a short overview

xloops is a program package that calculates Feynman diagrams by using computer algebra systems. In this paper it is shown which problems to be solved by computer algebra arise during such calculations, and how this problems are handled in the framework of xloops.

متن کامل

A Simple Algorithm for Automatic Generation of Polyphonic Piano Fingerings

We present a novel method for assigning fingers to notes in a polyphonic piano score. Such a mapping (called a “fingering”) is of great use to performers. To accommodate performers’ unique hand sha our method relies on a simple, user function. We use dynamic programming to search the space of all possible fingerings for the optimal fingering under this cost function. Despite the simplicity of t...

متن کامل

Automatic Test Data Generation using Genetic Algorithm using Sequence Diagram

The most striking feature of SDLC is software testing. It is very labour-intensive and expensive process in software development and handling as well as maintenance of software. The main objective of this paper is to extend the testing technique. Testing is to show the incorrectness and is considered to succeed when an error is detected [Myers79]. Today’s automatic testing has replaced manual t...

متن کامل

Percolation on a Feynman Diagram

In a recent paper [1] we investigated Potts models on “thin” random graphs – generic Feynman diagrams, using the idea that such models may be expressed as the N → 1 limit of a matrix model. The models displayed first order transitions for all q > 2, giving identical behaviour to the corresponding Bethe lattice. We use here one of the results of [1] namely a general saddle point solution for a q...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computer Physics Communications

سال: 2013

ISSN: 0010-4655

DOI: 10.1016/j.cpc.2013.03.015